Coalitional Voting Manipulation: A Game-Theoretic Perspective
نویسندگان
چکیده
Computational social choice literature has successfully studied the complexity of manipulation in various voting systems. However, the existing models of coalitional manipulation view the manipulating coalition as an exogenous input, ignoring the question of the coalition formation process. While such analysis is useful as a first approximation, a richer framework is required to model voting manipulation in the real world more accurately, and, in particular, to explain how a manipulating coalition arises and chooses its action. In this paper, we apply tools from cooperative game theory to develop a model that considers the coalition formation process and determines which coalitions are likely to form and what actions they are likely to take. We explore the computational complexity of several standard coalitional game theory solution concepts in our setting, and study the relationship between our model and the classic coalitional manipulation problem as well as the now-standard bribery model.
منابع مشابه
An NTU Cooperative Game Theoretic View of Manipulating Elections
Social choice theory and cooperative (coalitional) game theory have become important foundations for the design and analysis of multiagent systems. In this paper, we use cooperative game theory tools in order to explore the coalition formation process in the coalitional manipulation problem. Unlike earlier work on a cooperative-game-theoretic approach to the manipulation problem [2], we conside...
متن کاملManipulation under voting rule uncertainty
An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...
متن کاملManipulation Under Voting Rule Uncertainty1
An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...
متن کاملCan a Condorcet Rule Have a Low Coalitional Manipulability?
We investigate the possibility of designing a voting rule that both meets the Condorcet criterion and has a low vulnerability to coalitional manipulation. For this purpose, we examine the Condorcification of a voting rule, where the original rule is altered to elect the Condorcet winner when one exists, and we study its impact on coalitional manipulability. A recent result states that for a lar...
متن کاملBoolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be winning if the sum of weights of agents in that coalition meets some stated threshold. We study a natural generalisation of weighted voting games called Boolean Weighted Voting Games (BWVGs). BWVGs are intended to mode...
متن کامل